ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR MIXED BLOCKING FLOWSHOP SCHEDULING PROBLEM

Traditional permutation flowshop scheduling problem (PFSP), which has unlimited buffer space, been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as aerospace industry and other sectors processing waste, have different blocking conditions due limited or lack of area between their machines. In this study, a mixture types is considered solve PFSP with total flow time criterion regarding types. A constraint programming model proposed mixed constraints (MBFSP). Due problem's NP-hard nature problem, an adaptive large neighborhood search heuristic size instances. The results algorithm are very competitive.